au.\*:("Ministry of Education and Science ; Acciones Integradas")
Results 1 to 6 of 6
Selection :
Probalistic complexity classes and nonuniform computational models. WorkshopInformatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 89-179, issn 0988-3754Conference Proceedings
On the robustness of ALMOST-RBOOK, R. V; MAYORDOMO, E.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 123-133, issn 0988-3754Conference Paper
Complexity classes between θpk and ΔpkCASTRO, J; SEARA, C.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 101-121, issn 0988-3754Conference Paper
Bounded queries to arbitrary setsLOZANO, A.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 91-100, issn 0988-3754Conference Paper
Monotonous and randomized reductions to sparse setsARVIND, V; KÖBLER, J; MUNDHENK, M et al.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 155-179, issn 0988-3754Conference Paper
On sets bounded truth-table reducible to P-selective setsTHIERAUF, T; TODA, S; WATANABE, O et al.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 2, pp 135-154, issn 0988-3754Conference Paper
